Symbolic model checking for μ-calculus requires exponential time
نویسندگان
چکیده
منابع مشابه
Symbolic model checking for µ-calculus requires exponential time
Model checking [3] is a very popular paradigm for automatic verification of properties of finite state systems like those defined by circuits or communication protocols. A system is interpreted as a finite state labeled transition system or equivalently as a finite Kripke structure. If sys contains k concurrent components, each with m states, then the Kripke structure described by sys may have ...
متن کاملDistributed Symbolic Model Checking for µ-Calculus
In this paper we propose a distributed symbolic algorithm for model checking of propositional μ–calculus formulas. μ-calculus is a powerful formalism and many problems like (fair) CTL and LTL model checking can be solved using the μ–calculus model checking. Previous works on distributed symbolic model checking were restricted to reachability analysis and safety properties. This work thus signi£...
متن کاملμ-Calculus Model Checking in Maude
In this paper, a rewrite theory for checking μ-calculus properties is developed. We use the same framework proposed in [EMS02] and demonstrate how rewriting logic can be used as a unified formalism from model specification to verification algorithm implementation. Furthermore, since μ-calculus is more expressive than LTL, this work can be seen as an extension to [EMS02] in theory. We also devel...
متن کاملSymbolic Model Checking for Real-time Systems
We describe nite-state programs over real-numbered time in a guardedcommand language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speci cation (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolic...
متن کاملModel-Checking the Higher-Dimensional Modal μ-calculus
The higher-dimensional modal μ-calculus is an extension of the μ-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in polynomial time, and conversely every polynomial-time decidable problem that has a bisimulation-invariant encoding into labeled transition systems can also be defined i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00033-5